The multivariate bisection algorithm

Multithread Lepp-Bisection Algorithm for Tetrahedral Meshes

Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A .699-approximation algorithm for Max-Bisection

An Ant System Algorithm For Graph Bisection

This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a solution to the problem nor a component of the solution directly. Rather the collective behavior of the two species of ants in the system induces a solution to ...

A Fuzzy Clustering Algorithm for Graph Bisection

A fuzzy clustering algorithm based on global connection information is proposed to solve the graph bisection problem.